Approximability of the robust representatives selection problem
نویسندگان
چکیده
منابع مشابه
Approximability of the robust representatives selection problem
In this paper new complexity and approximation results on the robust versions of the representatives selection problem, under the scenario uncertainty representation, are provided, which extend the results obtained in the recent papers by Dolgui and Kovalev (2012), and Deineko and Woeginger (2013). Namely, it is shown that if the number of scenarios is a part of input, then the min-max (regret)...
متن کاملOn the Approximability of the Selection Problem
Under the assumption EXPTIME 6= NEXPTIME, we show the nonexistence of polynomial-time bounded-error approximation algorithms solving the MAX-Selection problem. In addition, a linear reduction from the MAX2SAT problem to the MAX-Selection problem is given. Therefore, if there exists a polynomial-time approximation scheme for the MAX-Selection problem, then P = NP.
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولNew Approximability Results for the Robust k-Median Problem
We consider a variant of the classical k-median problem, introduced by Anthony et al. [1]. In the Robust k-Median problem, we are given an n-vertex metric space (V, d) and m client sets {Si ⊆ V }mi=1. We want to open a set F ⊆ V of k facilities such that the worst case connection cost over all client sets is minimized; that is, minimize maxi ∑ v∈Si d(F, v). Anthony et al. showed an O(logm) appr...
متن کاملThe Problem of Compatible Representatives
The purpose of this note is to attach a name to a natural class of combinatorial problems and to point out that this class includes many important special cases. We also show that a simple problem of placing nonoverlapping labels on a rectangular map is NP-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2015
ISSN: 0167-6377
DOI: 10.1016/j.orl.2014.10.007